Associativeness versus Recursiveness

Theory and Methodology Representation of consistent recursive rules

This paper develops the recursive model for connective rules (as proposed in V. Cutello, E. Molina, J. Montero, Associativeness versus recursiveness, in: Proceedings of the 26th IEEE International Symposium on Multiple-valued Logic, Santiago de Compostela, Spain, 29±31 May, 1996, pp. 154±159; V. Cutello, E. Molina, J. Montero, Binary operators and connective rules, in: M.H. Smith, M.A. Lee, J. ...

Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools

This paper aims to show that, in order to capture a quite relevant feature such as the recursiveness of abstract data types, Model Theory works better than Category Theory. First, various eategorial notions such as "initiality", "finality", "monoinitiality", "epifinality", "weak monoinitiality" and "weak epifinality' are analyzed, from a model theoretic point of view, as regards the "abstractne...

Disentangling Alliance Management Processes: Decision Making, Politicality, and Alliance Performance

Using a sample of 106 organizations engaged in strategic alliances, we develop and test a framework of alliance-related organizational decision-making processes and their impact on alliance performance. With regard to direct effects, our results show a negative impact of decision-making recursiveness and no significant relationship for openness and procedural rationality. Acknowledging the impo...

A World Where Relative Definability Coincides With Relative Recursiveness (i.e., Turing Reducibility)

Bounded Limit Recursiveness

Let X be a Turing oracle. A function f(n) is said to be boundedly limit recursive in X if it is the limit of an X-recursive sequence of X-recursive functions f̃(n, s) such that the number of times f̃(n, s) changes is bounded by a recursive function of n. Let us say that X is BLR-low if every function which is boundedly limit recursive in X is boundedly limit recursive in 0. This is a lowness prop...